CM1_Amit edit
نویسندگان
چکیده
Background: Awareness on human immuno-deficiency virus (HIV)/acquired immuno-deficiency syndrome (AIDS) can help reduce the risk of contracting this public health important disease and associated burdens. However, today’s adolescent grows up surrounded by mixed messages about HIV/AIDS. Objectives: To assess awareness on HIV/AIDS among adolescent students. Methods: A cross-sectional study was conducted among adolescent students of a selected secondary Public school of Delhi. Sample comprised 100 students (Class IX) selected through random sampling from the study school. Data were collected using a pre-designed, pilot-tested, semi-structured questionnaire focusing on awareness on HIV/AIDS. Results: Awareness of sample respondents (67 boys and 33 girls, aged 14-18 years) on various aspects of HIV/AIDS was as follows: immune-deficiency nature of disease (49.5%), asymptomatic in initial stage (55.9%), transmission routes (73.2%), relationship between HIV and sexually-transmitted infections (28.0%), risk from having multiple partners (68.0%), risk from sharing unsterilized needles (48.9%), no transmission through mosquitoes (49.0%), no risk from merely living together (45.7%), no risk from sharing clothes (55.2%), no risk from handling food (43.5%), no risk from studying together (74.5%), no vaccine available (41.4%), and some preventive/safety measures (blood testing, 60.0%, condom usage, 67.7%). Conclusion: Adolescent students have a mixed pattern of awareness on HIV/AIDS. A significant proportion of them does not know about its risk factors, risk practices and preventive/safety measures, which may pose an increased risk of this disease to them. It calls for suitable measures (like appropriate HIV/AIDS education programmes) to increase their awareness on HIV/AIDS and reduce risk of this disease.
منابع مشابه
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)
The edit distance between two rooted ordered trees with n nodes labeled from an alphabet Σ is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. Tree edit distance is a well known generalization of string edit distance. The fastest known algorithm for tree edit dist...
متن کاملMap Edit Distance vs. Graph Edit Distance for Matching Images
Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...
متن کاملA Quadratic Programming Approach to the Graph Edit Distance Problem
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost edit path between graphs, we introduce the notion of fuzzy edit paths between graphs and provide a quadratic programming formulation for the minimization of fuzzy edit costs. Experiments on real-world graph data demonstr...
متن کاملAn Eecient Uniform-cost Normalized Edit Distance Algorithm
A common model for computing the similarity of two strings X and Y of lengths m, and n respectively with m n, is to transform X into Y through a sequence of edit operations which are of three types: insertion, deletion, and substitution of symbols. The model assumes a given weight function which assigns a non-negative real cost to each of these edit operations. The amortized weight for a given ...
متن کاملEdit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the formality and rigour of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that standard string edit distance techniques can be used. To do this we use graph spectral seri...
متن کامل